Packet-Pair Flow Control
نویسنده
چکیده
This paper presents the packet-pair rate-based feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (best-effort) component of integrated networks. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose a linear stochastic model for a single conversation in a network of such switches. These model motivates the Packet-Pair rate probing technique, which forms the basis for provably stable discrete and continuous time rate-based flow control schemes. We present a novel state estimation scheme based on fuzzy logic. We then address several practical concerns: dealing with system startup, retransmission and timeout strategy, and dynamic setpoint probing. We present a finite state machine as well as source code for a model implementation. The dynamics of a single source, the interactions of multiple sources, and the behavior of packet-pair sources in a variety of benchmark scenarios are evaluated by means of detailed simulations. We close with some remarks about possible extensions to packet-pair, limitations of this work, and an outline of related work.
منابع مشابه
Reliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملReliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملNew High Secure Network Steganography Method Based on Packet Length
In network steganography methods based on packet length, the length of the packets is used as a carrier for exchanging secret messages. Existing methods in this area are vulnerable against detections due to abnormal network traffic behaviors. The main goal of this paper is to propose a method which has great resistance to network traffic detections. In the first proposed method, the sender embe...
متن کاملSMART Retransmission: Performance with Overload and Random Losses
Feedback flow control, in conjunction with limited buffering in the network, inevitably leads to packet loss. Effective congestion control requires not only effective flow control but also a good retransmission strategy. We present a new retransmission strategy called SMART that combines the best features of the traditional go-back-n and selective-retransmit strategies. We show, first, that go-...
متن کاملOn the Comparison of Packet-Pair and Packet-Train Measurements
Measurements of link bandwidth and available bandwidth are getting increasingly important in the Internet. One example is to verify service level agreements (customer: “Do I get the bandwidth I’m paying for?”). When developing accurate measurement methods based on active probing it is important to understand (at the packet level) how probe-packet flows and cross-traffic flows interact with each...
متن کامل